Generating normative rules with ILP techniques

نویسنده

  • Nienke den Haan
چکیده

This paper describes the use of inductive logic programming techniques in a legislative drafting environment. The drafter supplies a set of positive and negative situations. These situations are transformed into normative rules, i.e. rules that oblige, forbid or permit behaviour. Drafters may impose four diierent types of requirements on the rule generation process, in order to obtain alternative legislative architectures. Legislative drafting is the process in which the government or other legislative bodies decide to formulate new laws, and teams of drafters deene them in terms of (normative) goals, and subsequently codify their goals as law texts 1. Drafting regulations may vary from drafting a contract, a simple regulation for the local library, to legislative drafting under the responsibility of a particular Ministry. In particular for the latter version of this task, the stakes are high, and (semi) automated tools may be welcomed. However , legislative drafting is a complex and empirically not well studied task. 2 Moreover, methodological support is almost absent. There are a few operative systems that ooer automated support for legislative drafting. The systems that support information retrieval and editing tools are systems that provide textual support for drafting new legislation, for instance the LEDA system Voermans, 1995]. Textual support for legislative drafting can be ooered by relatively simple systems (databases, hypertext systems, ooce systems), and concerns information retrieval of relevant texts or electronic communication between drafters. Other legal knowledge-based systems ooer consistency checking of regulations Although textual support provides legislative drafters with intelligent editors that embed the legislative format, and information retrieval provides the relevant background infor-1 Legislative theory on drafting procedures describes general requirements to the drafting process and the composition of new regulations 2 Other terms are: design or modelling tasks, see for instance Breuker & van deVelde, 1994]. mation, drafters still spend large amounts of time codifying their ideas into rules. The approach described in this paper proposes a structured approach for codiication: First, one models the domain that is to be regulated in terms of a (simplistic) world ontology. A world description consists of agents, objects and actions. 3 For instance, for regulating traac behaviour one has to deene types of agents (e.g. cars, trams, cyclists), objects (e.g. road, traac light), and actions (e.g. overtake left, overtake right). The types are organized in abstraction hierarchies, e.g. types of vehicles, where car, tram and bicycle are subtypes of vehicle. Next, a situation …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Applying Type-Oriented ILP to IE Rule Generation

This paper describes our approach to applying typeoriented inductive logic programming (ILP) to information extraction (IE) tasks and the latest experimental results in learning IE rules from the data generated from 100 newspaper articles. Information extraction involves extracting key information from text corpus in order to ll empty slots of given templates. A bottle neck in building IE syste...

متن کامل

Boosting Descriptive ILP for Predictive Learning in Bioinformatics

Boosting is an established propositional learning method to promote the predictive accuracy of weak learning algorithms, and has achieved much empirical success. However, there have been relatively few efforts to apply boosting to Inductive Logic Programming (ILP) approaches. We investigate the use of boosting descriptive ILP systems, by proposing a novel algorithm for generating classification...

متن کامل

Towards Structural Logistic Regression: Combining Relational and Statistical Learning

Inductive logic programming (ILP) techniques are useful for analyzing data in multi-table relational databases. Learned rules can potentially discover relationships that are not obvious in "flattened" data. Statistical learners, on the other hand, are generally not constructed to search relational data; they expect to be presented with a single table containing a set of feature candidates. Howe...

متن کامل

Mining Association Rules in Multiple Relations

The application of algorithms for eeciently generating association rules is so far restricted to cases where information is put together in a single relation. We describe how this restriction can be overcome through the combination of the available algorithms with standard techniques from the eld of inductive logic programming. We present the system Warmr, which extends Apriori 2] to mine assoc...

متن کامل

Incorporating Linguistic Expertise Using ILP for Named Entity Recognition in Data Hungry Indian Languages

Developing linguistically sound and data-compliant rules for named entity annotation is usually an intensive and time consuming process for any developer or linguist. In this work, we present the use of two Inductive Logic Programming (ILP) techniques to construct rules for extracting instances of various named entity classes thereby reducing the efforts of a linguist/developer. Using ILP for r...

متن کامل

Relational Knowledge Extraction from Attribute-Value Learners

Bottom Clause Propositionalization (BCP) is a recent propositionalization method which allows fast relational learning. Propositional learners can use BCP to obtain accuracy results comparable with Inductive Logic Programming (ILP) learners. However, differently from ILP learners, what has been learned cannot normally be represented in first-order logic. In this paper, we propose an approach an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997